Deep Sparse Depth Completion Using Multi-Affinity Matrix

نویسندگان

چکیده

Image-guided depth completion aims to generate dense maps from sparse guided by their corresponding color (RGB) images. In this paper, we propose deep using multi-affinity matrix. Recently, spatial propagation networks (SPNs) are used refine obtained initial completion. However, they use the same affinity matrix even in multiple iterations that has a limit improving performance, which is not effective considering relationship between adjacent pixels. Thus, replace it with represent an output pixel and its neighboring ones. Moreover, neural can effectively fuse features two different modalities based on confidence maps. Inspired dynamic filtering, convolutional network (CSPN) multi-modal at stages. When training branch of proposed network, adopt supervised learning constrains all layers decoder. Since spatially varying required for feature fusion, produces adaptive single Experimental results KITTI NYU-v2 datasets show represents dependency pixels predicts accurate values calculating weights The achieves state-of-the-art performance terms root mean square error (RMSE) absolute (MAE).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preprocessing sparse semidefinite programs via matrix completion

Considering that preprocessing is an important phase in linear programming, it should be systematically more incorporated in semidefinite programming solvers. The conversion method proposed by the authors (SIAM Journal on Optimization, vol. 11, pp. 647–674, 2000, and Mathematical Programming, Series B, vol. 95, pp. 303–327, 2003) is a preprocessing of sparse semidefinite programs based on matri...

متن کامل

Sparse Deep Nonnegative Matrix Factorization

Nonnegative matrix factorization is a powerful technique to realize dimension reduction and pattern recognition through single-layer data representation learning. Deep learning, however, with its carefully designed hierarchical structure, is able to combine hidden features to form more representative features for pattern recognition. In this paper, we proposed sparse deep nonnegative matrix fac...

متن کامل

Deep Depth Completion of a Single RGB-D Image

The goal of our work is to complete the depth channel of an RGB-D image. Commodity-grade depth cameras often fail to sense depth for shiny, bright, transparent, and distant surfaces. To address this problem, we train a deep network that takes an RGB image as input and predicts dense surface normals and occlusion boundaries. Those predictions are then combined with raw depth observations provide...

متن کامل

Deep Convolutional Compressed Sensing for LiDAR Depth Completion

In this paper we consider the problem of estimating a dense depth map from a set of sparse LiDAR points. We use techniques from compressed sensing and the recently developed Alternating Direction Neural Networks (ADNNs) to create a deep recurrent auto-encoder for this task. Our architecture internally performs an algorithm for extracting multi-level convolutional sparse codes from the input whi...

متن کامل

Multi-dimensional Sparse Matrix Storage

Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computations with such matrices, thus their implementation should be very carefully designed. In this paper we discuss three implementations of sparse matrices. The first one is classical, based on lists. The second is previ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3295133